- rewriting system
- Вычислительная техника: перезаписывающая система
Универсальный англо-русский словарь. Академик.ру. 2011.
rewriting system
Смотреть что такое "rewriting system" в других словарях:
Abstract rewriting system — In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviation ARS) is a formalism that captures the quintessential notion and properties of… … Wikipedia
Rewriting — In mathematics, computer science and logic, rewriting covers a wide range of potentially non deterministic methods of replacing subterms of a formula with other terms. What is considered are rewrite systems (also rewriting systems, or term… … Wikipedia
System/34 BASIC — IBM System/34 BASIC was an interpreter for the IBM System/34 midrange computer.System/34 BASIC was first offered in 1978, and as such, contained many of the trappings that a BASIC program would have encountered in the time period of the TRS 80,… … Wikipedia
System/36 BASIC — IBM System/36 BASIC was an interpreter for the IBM System/36 midrange computer.System/36 BASIC was first offered in 1983, and as such, contained many of the trappings that a BASIC program would have encountered in the time period of the IBM PC,… … Wikipedia
Confluence (abstract rewriting) — In computer science, confluence is a property of rewriting systems, describing that terms in this system can be rewritten in more than one way, to yield the same result. This article describes the properties in the most abstract setting of an… … Wikipedia
Confluence (term rewriting) — Confluence is a property of term rewriting systems, describing that terms in this system can be rewritten in more than one way, to yield the same result. Motivating example Consider the rules of regular arithmetic. We can think of these rules as… … Wikipedia
Semi-Thue system — In computer science and mathematics a Semi Thue system (also called a string rewriting system [Book and Otto, p. 36] ) is a type of term rewriting system. It is named after the Norwegian mathematician Axel Thue, who introduced systematic… … Wikipedia
Graph rewriting — In graph theory, graph rewriting is a system of rewriting for graphs, i.e. a set of graph rewrite rules of the form p: L ightarrow R, with L being called pattern graph (or left hand side) and R being called replacement graph (or right hand side… … Wikipedia
Abstract rewriting machine — The Abstract Rewriting Machine (ARM) is a virtual machine which implements term rewriting for minimal term rewriting systems. Minimal term rewriting systems are left linear term rewriting systems in which each rule takes on one of six forms:… … Wikipedia
Normal form (abstract rewriting) — In abstract rewriting, a normal form is an element of the system which cannot be rewritten any further. Stated formally, for some reduction relation ⋅ → ⋅ over X a term t in X is a normal form if there does not exist a term t′ in X such … Wikipedia
Overlap (term rewriting) — In mathematics, computer science and logic, overlap, as a property of the reduction rules in term rewriting system, describes a situation where a number of different reduction rules specify potentially contradictory ways of reducing a reducible… … Wikipedia
